Papers with graph-based constituent parsing
N-ary Constituent Tree Parsing with Recursive Semi-Markov Model (2021.acl-long)
Copied to clipboard
| Challenge: | Existing graph-based constituent parsing methods generate hidden nodes with the dummy label inside the n-ary nodes to transform the tree into a binary tree for prediction. |
| Approach: | They propose a graph-based constituent parsing framework that uses a 1-order semi-Markov model to predict the immediate children sequence of a constituent candidate. |
| Outcome: | The proposed framework obtains the F1 of 95.92% and 92.50% on the datasets of PTB and CTB 5.1 respectively. |